Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
نویسندگان
چکیده
We study adiabatic reverse annealing (ARA) in an open system. In the closed system (unitary) setting, this protocol allows avoidance of first-order quantum phase transitions selected models, resulting exponential speedup compared with standard annealing, provided that initial state algorithm is close Hamming distance to target one. Here, we show decoherence can significantly modify conclusion: by resorting master equation approach, simulate dynamics ferromagnetic $p$-spin model $p=3$ under independent and collective dephasing. For both models decoherence, performance ARA far less sensitive choice than its unitary counterpart, and, most significantly, large loses time solution advantage annealing. These results suggest as a stand-alone strategy unlikely experimentally outperform ``forward'' error mitigation strategies will likely be required order realize benefits realistic, noisy settings.
منابع مشابه
Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function depends only on the Hamming weight of the n bits. We also give two examples, closely related to these, where the similarity breaks down in that the quantum adia...
متن کاملAdiabatic Quantum Computation and Quantum Annealing: Theory and Practice
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd adiabatic quantum computation and quantum annealing theory and practice catherine c m...
متن کاملNon-classical Role of Potential Energy in Adiabatic Quantum Annealing
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical potential energy function and the search for the global potential minimum is performed by employing external kinetic quantum fluctuations and subsequent slow reduction (annealing) of them. In this method, the entire pot...
متن کاملQuantum annealing
Quantum annealing Quantum annealing (also known as alloy, crystallization or tempering) is analogous to simulated annealing but in substitution of thermal activation by quantum tunneling. The class of algorithmic methods for quantum annealing (dubbed: 'QA'), sometimes referred by the italian school as Quantum Stochastic Optimization ('QSO'), is a promising metaheuristic tool for solving local s...
متن کاملFaster Annealing Schedules for Quantum Annealing
New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2022
ISSN: ['1538-4446', '1050-2947', '1094-1622']
DOI: https://doi.org/10.1103/physreva.105.032431